156 research outputs found
LoLa: a modular ontology of logics, languages and translations
The Distributed Ontology Language (DOL), currently being standardised within the OntoIOp (Ontology Integration and Interoperability) activity of ISO/TC 37/SC 3, aims at providing a unified framework for (i) ontologies formalised in heterogeneous logics, (ii) modular ontologies, (iii) links between ontologies, and (iv) annotation of ontologies.\ud
\ud
This paper focuses on the LoLa ontology, which formally describes DOL's vocabulary for logics, ontology languages (and their serialisations), as well as logic translations. Interestingly, to adequately formalise the logical relationships between these notions, LoLa itself needs to be axiomatised heterogeneously---a task for which we choose DOL. Namely, we use the logic RDF for ABox assertions, OWL for basic axiomatisations of various modules concerning logics, languages, and translations, FOL for capturing certain closure rules that are not expressible in OWL (For the sake of tool availability it is still helpful not to map everything to FOL.), and circumscription for minimising the extension of concepts describing default translations
Towards Linguistically-Grounded Spatial Logics
We propose a method to analyze the amount of coverage and adequacy of spatial calculi by relating a calculus to a linguistic ontology for space by using similarities and linguistic corpus data. This allows evaluating whether and where a spatial calculus can be used for natural language interpretation. It can also lead to \u27more appropriate\u27 spatial logics for spatial language
Towards Resolution-based Reasoning for Connected Logics
AbstractThe method of connecting logics has gained a lot of attention in the knowledge representation and ontology communities because of its intuitive semantics and natural support for modular KR, its generality, and its robustness concerning decidability preservation. However, so far no dedicated automated reasoning solutions have been developed, and the only reasoning available was via translation into sufficiently expressive logics. In this paper, we present a simple modalised version of basic E-connections, and develop a sound, complete, and terminating resolution-based reasoning procedure. The approach is modular and can be extended to more expressive versions of E-connections
Two Approaches to Ontology Aggregation Based on Axiom Weakening
Axiom weakening is a novel technique that allows
for fine-grained repair of inconsistent ontologies.
In a multi-agent setting, integrating ontologies corresponding
to multiple agents may lead to inconsistencies.
Such inconsistencies can be resolved after
the integrated ontology has been built, or their
generation can be prevented during ontology generation.
We implement and compare these two approaches.
First, we study how to repair an inconsistent
ontology resulting from a voting-based aggregation
of views of heterogeneous agents. Second,
we prevent the generation of inconsistencies by letting
the agents engage in a turn-based rational protocol
about the axioms to be added to the integrated
ontology. We instantiate the two approaches using
real-world ontologies and compare them by measuring
the levels of satisfaction of the agents w.r.t.
the ontology obtained by the two procedures
The Distributed Ontology Language (DOL): Use Cases, Syntax, and Extensibility
The Distributed Ontology Language (DOL) is currently being standardized
within the OntoIOp (Ontology Integration and Interoperability) activity of
ISO/TC 37/SC 3. It aims at providing a unified framework for (1) ontologies
formalized in heterogeneous logics, (2) modular ontologies, (3) links between
ontologies, and (4) annotation of ontologies. This paper presents the current
state of DOL's standardization. It focuses on use cases where distributed
ontologies enable interoperability and reusability. We demonstrate relevant
features of the DOL syntax and semantics and explain how these integrate into
existing knowledge engineering environments.Comment: Terminology and Knowledge Engineering Conference (TKE) 2012-06-20 to
2012-06-21 Madrid, Spai
Repairing Ontologies via Axiom Weakening.
Ontology engineering is a hard and error-prone task, in which
small changes may lead to errors, or even produce an inconsistent
ontology. As ontologies grow in size, the need for automated
methods for repairing inconsistencies while preserving
as much of the original knowledge as possible increases.
Most previous approaches to this task are based on removing
a few axioms from the ontology to regain consistency.
We propose a new method based on weakening these axioms
to make them less restrictive, employing the use of refinement
operators. We introduce the theoretical framework for
weakening DL ontologies, propose algorithms to repair ontologies
based on the framework, and provide an analysis of
the computational complexity. Through an empirical analysis
made over real-life ontologies, we show that our approach
preserves significantly more of the original knowledge of the
ontology than removing axioms
Orchestrating a Network of Mereo(topo)logical Theories: An Abridged Report
Parthood is used widely in ontologies across subject domains, specified in a multitude of mereological theories, and even more when combined with topology. To complicate the landscape, decidable languages put restrictions on the language features, so that only fragments of the mereo(topo)logical theories can be represented, even though those full features may be needed to check correctness during modelling. We address these issues by specifying a structured network of theories formulated in multiple logics that are glued together by the various linking constructs of the Distributed Ontology Language, DOL. For the KGEMT mereotopology and its five sub-theories, together with the DL-based OWL species and first- and second-order logic, this network in DOL orchestrates 28 ontologies
Proof Support for Common Logic
We present an extension of the Heterogeneous Tool Set HETS that enables proof support for Common Logic. This is achieved via logic translations that relate Common Logic and some of its sublogics to already supported logics and automated theorem proving systems. We thus provide the first full theorem proving support for Common Logic, including the possibility of verifying meta-theoretical relationships between Common Logic theories
- …